A More Explicit Formula for Linear Probabilities of Modular Addition Modulo a Power of Two
نویسندگان
چکیده
Linear approximations of modular addition modulo a power of two was studied by Wallen in 2003. He presented an efficient algorithm for computing linear probabilities of modular addition. In 2013 Schulte-Geers investigated the problem from another viewpoint and derived a somewhat explicit formula for these probabilities. In this note we give a closed formula for linear probabilities of modular addition modulo a power of two, based on what Schulte-Geers presented: our closed formula gives a better insight on these probabilities and more information can be extracted from it.
منابع مشابه
Algebraic Properties of Modular Addition Modulo a Power of Two
Modular addition modulo a power of two, is one of the most applicable operators in symmetric cryptography; therefore, investigating cryptographic properties of this operator has a significant role in design and analysis of symmetric ciphers. Algebraic properties of modular addition modulo a power of two have been studied for two operands by Braeken in fse’05. Also, the authors of this paper, ha...
متن کاملOn Newton-Raphson iteration for multiplicative inverses modulo prime powers
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over p-adic numbers gives a recurrence relation computing modular inverse modulo p, that is logarithmic in m. We solve the recurrence to obtain an explicit formula for the inverse. Then we study different implementation variants of this iteration and show that our explicit formula is interesting for small...
متن کاملAn explicit formula for the number of fuzzy subgroups of a finite abelian $p$-group\ of rank two
Ngcibi, Murali and Makamba [Fuzzy subgroups of rank two abelian$p$-group, Iranian J. of Fuzzy Systems {bf 7} (2010), 149-153]considered the number of fuzzy subgroups of a finite abelian$p$-group $mathbb{Z}_{p^m}times mathbb{Z}_{p^n}$ of rank two, andgave explicit formulas for the cases when $m$ is any positiveinteger and $n=1,2,3$. Even though their method can be used for thecases when $n=4,5,l...
متن کاملA Simple Trace Formula for Algebraic Modular Forms
We derive an elementary formula for the trace of a Hecke operator acting on a space of algebraic modular forms, as a sum of character values. We describe explicit computations in the case of the unitary group U(4), allowing the determination of the eigenvalues of a certain Hecke operator. This produces numerical evidence for a U(2, 2) analogue of Harder’s conjecture, on congruences between Heck...
متن کاملLinear Approximations of Addition Modulo 2n
Addition modulo 2 − 1 is a basic arithmetic operation in the stream cipher ZUC. For evaluating ZUC in resistance to linear cryptanalysis, it is necessary to study properties of linear approximations of the addition modulo 2 − 1. In this paper we discuss linear approximations of the addition modulo 2 − 1 for integer n ≥ 2. As results, an exact formula on the correlations of linear approximations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015